package algorithm.programming.test;

import algorithm.programming.basic.*;

/**
 * 项目名称: god
 * 包 名 称: algorithm.programming.test
 * 类 名 称: Main
 * 类 描 述: TODO
 * 创建时间: 2020/7/15 4:50 下午
 * 创 建 人: Justice
 */
public class Main {
    public static void main(String[] args) {
//        int[] faces = {1,5,20,25};
//        System.out.println(Coin.coins5(41, faces));

//        int[] array = new int[] {-2,1,-3,4,-1,2,1,-5,4};
//        int i = SubArray.maxSubArray2(array);
//        System.out.println(i);
        int[] nums = new int[]{10, 2, 2, 5, 1, 7, 101, 18};
        System.err.println(LongestIncreasingSubsequence.longSubsequence3(nums));
        // System.out.println(LongestCommonSubsequence.test5(new int[] {1, 3, 5, 9, 10}, new int[] {1, 4, 9, 10}));
//        String s1 = "abc";
//        String s2 = "bcd";
//        System.out.println(LongestCommonSubstring.test3(s1, s2));
//
//        int[] values = {6, 3, 5, 4, 6};
//        int[] weights = {2, 2, 6, 5, 4};
//        int capacity = 10;
//        System.out.println(Knapsack.maxValueExactly(values, weights, capacity));

    }
}
